Near-vector spaces constructed from near domains

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

COUNTABLY NEAR PS-COMPACTNESS IN L-TOPOLOGICAL SPACES

In this paper, the concept of countably near PS-compactness inL-topological spaces is introduced, where L is a completely distributive latticewith an order-reversing involution. Countably near PS-compactness is definedfor arbitrary L-subsets and some of its fundamental properties are studied.

متن کامل

Near Rough and Near Exact Subgraphs in Gm-Closure Spaces

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition...

متن کامل

Approach Spaces for Near Families

This article considers the problem of how to formulate a framework for the study of the nearness of collections of subsets of a set (also more tersely termed families of a set). The solution to the problem stems from recent work on approach spaces, near sets, and a specialised form of gap functional. The collection of all subsets of a set equipped with a distance function is an approach space.

متن کامل

Density near zero

Let $S$ be a dense subsemigroup of $(0,+infty)$. In this paper, we state   definition of thick near zero, and also  we will introduce a definition that is equivalent to the definition of piecewise syndetic near zero which presented by Hindman  and Leader in [6].  We define density near zero for subsets of $S$ by a collection of nonempty finite subsets of $S$ and we investigate the conditions un...

متن کامل

Near-Optimal Search in Continuous Domains

We investigate search problems in continuous state and action spaces with no uncertainty. Actions have costs and can only be taken at discrete time steps (unlike the case with continuous control). Given an admissible heuristic function and a starting state, the objective is to find a minimum-cost plan that reaches a goal state. As the continuous domain does not allow the tight optimality result...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Miskolc Mathematical Notes

سال: 2018

ISSN: 1787-2405,1787-2413

DOI: 10.18514/mmn.2018.2186